On integer programming with bounded determinants
نویسندگان
چکیده
منابع مشابه
On Bounded Integer Programming
We present an efficient reduction from the Bounded integer programming (BIP) to the Subspace avoiding problem (SAP) in lattice theory. The reduction has some special properties with some interesting consequences. The first is the new upper time bound for BIP, poly(ϕ) · n n+o(n) (where n and ϕ are the dimension and the input size of the problem, respectively). This is the best bound up to now fo...
متن کاملOn integer programing with restricted determinants
Let A be an (m × n) integral matrix, and let P = {x : Ax ≤ b} be an n-dimensional polytope. The width of P is defined as w(P ) = min{x ∈ Z\{0} : maxx∈Pxu−minx∈Pxv}. Let ∆(A) and δ(A) denote the greatest and the smallest absolute values of a determinant among all r(A)× r(A) submatrices of A, where r(A) is the rank of a matrix A. We prove that if every r(A) × r(A) sub-matrix of A has a determinan...
متن کاملpreventive maintenance scheduling with integer programming and constraint programming
preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...
متن کاملLearning Bounded Tree-width Bayesian Networks using Integer Linear Programming
In many applications one wants to compute conditional probabilities given a Bayesian network. This inference problem is NP-hard in general but becomes tractable when the network has low tree-width. Since the inference problem is common in many application areas, we provide a practical algorithm for learning bounded tree-width Bayesian networks. We cast this problem as an integer linear program ...
متن کاملApplying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity
In the past 30 years, results regarding special classes of integer linear (and, more generally, convex) programs flourished. Applications in the field of parameterized complexity were called for and the call has been answered, demonstrating the importance of connecting the two fields. The classical result due to Lenstra states that solving Integer Linear Programming in fixed dimension is polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2015
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-015-0943-y